The modified shift-splitting preconditioners for nonsymmetric saddle-point problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block LU Preconditioners for Symmetric and Nonsymmetric Saddle Point Problems

In this paper, a block LU preconditioner for saddle point problems is presented. The main diierence between the approach presented here and that of other studies is that an explicit, accurate approximation of the Schur complement matrix is eeciently computed. This is used to compute a preconditioner to the Schur complement matrix that in turn deenes a preconditioner for a global iteration. The ...

متن کامل

A Class of Nonsymmetric Preconditioners for Saddle Point Problems

For iterative solution of saddle point problems, a nonsymmetric preconditioning is studied which, with respect to the upper-left block of the system matrix, can be seen as a variant of SSOR. An idealized situation where the SSOR is taken with respect to the skew-symmetric part plus the diagonal part of the upper-left block is analyzed in detail. Since action of the preconditioner involves solut...

متن کامل

On the generalized shift-splitting preconditioner for saddle point problems

In this paper, the generalized shift-splitting preconditioner is implemented for saddle point problems with symmetric positive definite (1,1)-block and symmetric positive semidefinite (2,2)-block. The proposed preconditioner is extracted form a stationary iterative method which is unconditionally convergent. Moreover, a relaxed version of the proposed preconditioner is presented and some proper...

متن کامل

Preconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *

We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...

متن کامل

Analysis of Preconditioners for Saddle-Point Problems

Analysis of pre onditioners for saddle-point problems D. Loghin and A. J. Wathen Mixed nite element formulations give rise to large, sparse, blo k linear systems of equations the solution of whi h is often sought via a pre onditioned iterative te hnique. In this work we present a general analysis of blo kpre onditioners based on the stability onditions inherited from the formulation of the nite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2016

ISSN: 0893-9659

DOI: 10.1016/j.aml.2016.03.011